Fractional Path Coloring with Applications to WDM Networks
نویسندگان
چکیده
This paper addresses the natural relaxation of the path coloring problem, in which one needs to color directed paths on a symmetric directed graph with a minimum number of colors, in such a way that paths using the same arc of the graph have different colors. This classic combinatorial problem finds applications in the minimization of the number of wavelengths in wavelength division multiplexing (wdm) all–optical networks.
منابع مشابه
Fractional and Integral Coloring of Locally-Symmetric Sets of Paths on Binary Trees
Motivated by the problem of allocating optical bandwidth in tree–shaped WDM networks, we study the fractional path coloring problem in trees. We consider the class of locally-symmetric sets of paths on binary trees and prove that any such set of paths has a fractional coloring of cost at most 1.367L, where L denotes the load of the set of paths. Using this result, we obtain a randomized algorit...
متن کاملRequest-specific routing in WDM grooming networks
Sub-wavelength traffic grooming in optical networks has gained significant importance in recent years due to the prevailing fractional wavelength traffic requirement of end-users. Dynamic routing schemes improve the performance of WDM grooming networks compared to static routing as they can adapt to changes in the network state. In this paper, the significance of dynamic routing of fractional w...
متن کاملThe Partition Coloring Problem and its Application to Wavelength Routing and Assignment
Some principles for designing a wide-area WDM optical network. [24] D. Welsh and M. Powell. An upper bound to the chromatic number of a graph and its application to timetable problems. Number of wavelengths 1-shortestpath 3 3 3 3 3 3 3 2-shortestpath + + + + + + + 3-shortestpath 2 2 2 2 2 2 2 Figure 9. NSFNET with k-shortest path routing. The x-axis represents the number of connections and the ...
متن کاملA Novel Approach for Detecting Relationships in Social Networks Using Cellular Automata Based Graph Coloring
All the social networks can be modeled as a graph, where each roles as vertex and each relationroles as an edge. The graph can be show as G = [V;E], where V is the set of vertices and E is theset of edges. All social networks can be segmented to K groups, where there are members in eachgroup with same features. In each group each person knows other individuals and is in touch ...
متن کاملRouting and Wavelength Assignment in Generalized WDM Tree Networks of Bounded Degree
The increasing popularity of all-optical networks has led to extensive research on the routing and wavelength assignment problem, also termed as the Routing and Path Coloring problem (RPC). Here we present a polynomial time algorithm that solves RPC exactly in generalized tree networks of bounded degree. This new topology is of practical interest since it models tree-like backbone networks conn...
متن کامل